n,k = list(map(int, input().split()))
lst = list(map(int, input().split()))
x=[]
ans=[]
sum=0
for i in range(n):
x.append([lst[i],i])
x.sort()
for i in range(n):
sum+=x[i][0]
if sum<=k:
ans.append(x[i][1]+1)
else:
break
ans.sort()
if len(ans)>0:
print(len(ans))
for i in ans:
print(i, end=' ')
else:
print(0)#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
using namespace std;
int main()
{
int n, k, t;
cin >> n >> k;
pair<int, int> c;
vector<pair<int, int>> d;
for (int i = 1; i <= n; i++)
{
cin >> t;
c = make_pair(t, i);
d.push_back(c);
}
sort(d.begin(), d.end());
int count = 0, sum = 0;
for (auto p : d)
{
sum += p.first;
if (sum > k)
{
break;
}
count++;
}
cout << count << endl;
for (int i = 0; i < count; i++)
cout << d[i].second << " ";
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |